Planning with Declarative Formalizations of Heuristics for Action Selection
ثبت نشده
چکیده
We propose a representation scheme for the declarative formalization of heuristics for action selection based on the situation calculus and circumscription. The formalism is applied to represent a number of heuristics for moving blocks in order to solve planning problems in the blocks world. An advice taking scenario is presented to illustrate how the action selection strategy of a program can be re ned by simple additions of better heuristics. Some examples are given in which the formalism is used to reason about the behaviors that may be caused by a number of strategies for action selection. Experiments showing how the use of declarative representations of heuristics for action selection allows improving the performance of state of the art planning systems are described.
منابع مشابه
Extensions of Answer Set Programming: Declarative Heuristics, Preferences and Online Planning
The goal of this thesis is to extend Answer Set Programming (ASP) with declarative heuristics, preferences, and online planning capabilities. For declarative heuristics, the thesis presents a general declarative approach for incorporating domain-specific heuristics into ASP solving by means of logic programming rules. For preferences, the approach developed in my thesis and the resulting asprin...
متن کاملUnified Definition of Heuristics for Classical Planning
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general language with disjunctivity and conditional effects first requires an exponential size reduction to STRIPS operators. I present direct formalizations of a number of distance heuristics for a general operator description ...
متن کاملOn Domain-Independent Heuristics for Planning with Qualitative Preferences
This paper describes a method for planning with rich qualitative, temporally extended preferences (QTEPs) using lookahead heuristics inspired by those employed in state-of-the-art classical planners. Key to our approach is a transformation of the planning domain into an equivalent but simplified planning domain. First, compound preference formulae are transformed into simpler, equivalent prefer...
متن کاملIntegrated Commonsense Reasoning and Probabilistic Planning
Commonsense reasoning and probabilistic planning are two of the most important research areas in artificial intelligence. This paper focuses on Integrated commonsense Reasoning and probabilistic Planning (IRP) problems. On one hand, commonsense reasoning algorithms aim at drawing conclusions using structured knowledge that is typically provided in a declarative way. On the other hand, probabili...
متن کاملSoundness and Completeness Theorems for Three Formalizations of Action
Instead of trying to compare methodologies for reasoning about action on the basis of speciic examples, we focus here on a general class of problems, expressible in a declarative language A. We propose three translations, P; R and B from A, representing respectively the rst order methods of reasoning about action proposed by Pednault and Reiter and the circumscriptive approach of Baker. We then...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000